class Solution {
public:
    int findLengthOfLCIS(vector<int>& nums)
    {
        int len = 0;
        for (int i = 0; i < nums.size();)
        {
            int left = i + 1;
            while (left<nums.size() && nums[left]>nums[left - 1])
            {
                left++;

            }
            if (left - i > len)
            {
                len = left - i;
            }
            i = left;
        }
        return len;
    }
};